#include <iostream>
#include<queue>
#include<vector>
using namespace std;

const int N = 1e6 + 10;
priority_queue<int> heap;

int main()
{
	int a[10] = {1, 41, 23, 10, 11, 2, -1, 99, 14, 0};
	for(int i = 0; i < 10; i++)
		heap.push(a[i]);
	while(heap.size())
	{
		cout << heap.top() << " ";
		heap.pop();
	}
	
	return 0;
}
